Solving parallel equations for Finite State Machines with Timeouts
نویسندگان
چکیده
منابع مشابه
Testing Finite State Machines Presenting Stochastic Time and Timeouts
In this paper we define a formal framework to test implementations that can be represented by the class of finite state machines introduced in [10]. First, we introduce an appropriate notion of test. Next, we provide an algorithm to derive test suites from specifications such that the constructed test suites are sound and complete with respect to two of the conformance relations introduced in [...
متن کاملDetecting faults in TFTP implementations using Finite State Machines with timeouts
In this paper, we consider a test derivation strategy for testing protocol implementations based on Finite State Machines with timeouts. The strategy is applied for testing TFTP implementations. Keywords-Finete State Machine (FSM); FSM with timeouts (timed FSM); transition tour
متن کاملA Parallel State Assignment Algorithm for Finite State Machines
This paper summarizes the design and implementation of a parallel algorithm for state assignment of large Finite State Machines. High performance CAD tools are necessary to overcome the computational complexity involved in the optimization of large sequential circuits. FSMs constitute an important class of logic circuits and state assignment is one of the key steps in combinational logic optimi...
متن کاملA Parallel Algorithm for State Assignment of Finite State Machines
Optimization of huge sequential circuits has become unmanageable in CAD of VLSI due to enormous time and memory requirements. In this paper, we report a parallel algorithm for the state assignment problem for nite state machines. Our algorithm has three sig-niicant contributions: It is an asynchronous parallel algorithm portable across diierent MIMD machines. Time and memory requirements reduce...
متن کاملSolving the ANTS Problem with Asynchronous Finite State Machines
Consider the Ants Nearby Treasure Search (ANTS) problem introduced by Feinerman, Korman, Lotker, and Sereni (PODC 2012), where n mobile agents, initially placed in a single cell of an infinite grid, collaboratively search for an adversarially hidden treasure. In this paper, the model of Feinerman et al. is adapted such that each agent is controlled by an asynchronous (randomized) finite state m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Institute for System Programming of RAS
سال: 2014
ISSN: 2079-8156,2220-6426
DOI: 10.15514/ispras-2014-26(6)-8